Equivalence classes of matrices over finite fields
نویسندگان
چکیده
منابع مشابه
On types and classes of commuting matrices over finite fields
This paper addresses various questions about pairs of similarity classes of matrices which contain commuting elements. In the case of matrices over finite fields, we show that the problem of determining such pairs reduces to a question about nilpotent classes; this reduction makes use of class types in the sense of Steinberg and Green. We investigate the set of scalars that arise as determinant...
متن کاملEigenvalues of Random Matrices over Finite Fields
We determine the limiting distribution of the number of eigenvalues of a random n×n matrix over Fq as n → ∞. We show that the q → ∞ limit of this distribution is Poisson with mean 1. The main tool is a theorem proved here on asymptotic independence for events defined by conjugacy class data arising from distinct irreducible polynomials. The proof of this theorem uses the cycle index for matrice...
متن کاملDynamic Structure of Matrices over Finite Fields
Given an endomorphism of a finite dimensional vector space Fq over a finite field, φ : Fq → Fq , we describe the dynamic structure of the function φ (that is, the decomposition in cycles of the permutation φ, in the bijective case) in terms of the elementary divisors of the endomorphism φ. Key-words: Graph, Finite Field, Endomorphism, Elementary divisors. 1 The dynamical graph of a function Def...
متن کاملInteger Sequences and Matrices Over Finite Fields
In this expository article we collect the integer sequences that count several different types of matrices over finite fields and provide references to the Online Encyclopedia of Integer Sequences (OEIS). Section 1 contains the sequences, their generating functions, and examples. Section 2 contains the proofs of the formulas for the coefficients and the generating functions of those sequences i...
متن کاملGood random matrices over finite fields
The random matrix uniformly distributed over the set of all mby-n matrices over a finite field plays an important role in many branches of information theory. In this paper a generalization of this random matrix, called k-good random matrices, is studied. It is shown that a k-good random m-by-n matrix with a distribution of minimum support size is uniformly distributed over a maximum-rank-dista...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1979
ISSN: 0024-3795
DOI: 10.1016/0024-3795(79)90031-4